On a Generalized Best Approximation Problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Best Approximation in TVS

In this paper  we give newresults on the best approximation  in the Hausdorff topological vectorspace and  consider relationship  with orthogonality. Also we determined under  what conditions the map $P_{K,f}$ is upper semicontinous.

متن کامل

Optimal Stopping Policy for Multivariate Sequences a Generalized Best Choice Problem

  In the classical versions of “Best Choice Problem”, the sequence of offers is a random sample from a single known distribution. We present an extension of this problem in which the sequential offers are random variables but from multiple independent distributions. Each distribution function represents a class of investment or offers. Offers appear without any specified order. The objective is...

متن کامل

Generalized best choice problem based on the information economics approach

We consider the problem of choosing the ‘best choice’ among a certain number of objects that are presented to a decision-maker in sequential order. Such a sequential selection problem is commonly referred to as the ‘best choice problem’, and its optimal stopping rule has been obtained either via the dynamic programming approach or via the Markovian approach. Based on the theory of information e...

متن کامل

Generalized Vector Implicit Variational Inequality Problem with Application to Best Approximation

We apply the KKM technique to study generalized vector implicit variational inequality problem. Our results generalize the works of Huang and Li [8], Li and Huang [11], and represent variant of result of Lee and Farajzadeh [10]. We also obtain a version of best approximations theorem in cone metric spaces.

متن کامل

A Characterization Theorem for the Discrete Best Monotonic Approximation Problem

A characterization theorem is derived that motivates a procedure for generating discrete best monotonie approximations to n sequential data values, when a strictly convex objective function is used in the calculation. The procedure is highly useful in the discrete nonlinear optimization calculation that produces the best piecewise monotonie approximations to the data.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Approximation Theory

سال: 1998

ISSN: 0021-9045

DOI: 10.1006/jath.1998.3177